منابع مشابه
Sharp Bounds for Generalized Uniformity Testing
We study the problem of generalized uniformity testing [BC17] of a discrete probability distribution: Given samples from a probability distribution p over an unknown discrete domain Ω, we want to distinguish, with probability at least 2/3, between the case that p is uniform on some subset of Ω versus -far, in total variation distance, from any such uniform distribution. We establish tight bound...
متن کاملEffect of Reticle CD Uniformity on Wafer CD Uniformity in the Presence of Scattering Bar Optical Proximity Correction
Amplification of reticle linewidth variations in imaging is examined through direct measurements of the mask error factor (MEF), which typically is used to describe this undesirable effect. The error observed in the aerial image linewidth is decoupled from the error in the resulting resist profile linewidth with the introduction of two separate mask error factors, namely the aerial image MEFaer...
متن کاملExistence of common best proximity points of generalized $S$-proximal contractions
In this article, we introduce a new notion of proximal contraction, named as generalized S-proximal contraction and derive a common best proximity point theorem for proximally commuting non-self mappings, thereby yielding the common optimal approximate solution of some fixed point equations when there is no common solution. We furnish illustrative examples to highlight our results. We extend so...
متن کاملModelling Spatial Relations by Generalized Proximity Matrices
One of the main challenges for the development of spatial information theory is the formalization of the concepts of space and spatial relations. Currently, most spatial data structures and spatial analytical methods used in GIS embody the notion of space as a set of absolute locations in a Cartesian coordinate system, thus failing to incorporate spatial relations which are dependent on topolog...
متن کاملGeneralized Proximity and Projection with Norms and Mixed-norms
We discuss generalized proximity operators (GPO) and their associated generalized projection problems. On inputs of size n, we show how to efficiently apply GPOs and generalized projections for separable norms and distance-like functions to accuracy in O(n log(1/ )) time. We also derive projection algorithms that run theoretically in O(n log n log(1/ )) time but can for suitable parameter range...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 1963
ISSN: 0016-2736,1730-6329
DOI: 10.4064/fm-52-3-235-252